Using Random Walks to Generate Associations between Objects
نویسندگان
چکیده
منابع مشابه
Using Random Walks to Generate Associations between Objects
Measuring similarities between objects based on their attributes has been an important problem in many disciplines. Object-attribute associations can be depicted as links on a bipartite graph. A similarity measure can be thought as a unipartite projection of this bipartite graph. The most widely used bipartite projection techniques make assumptions that are not often fulfilled in real life syst...
متن کاملRandom Walks on Combinatorial Objects
Approximate sampling from combinatorially-defined sets, using the Markov chain Monte Carlo method, is discussed from the perspective of combinatorial algorithms. We also examine the associated problem of discrete integration over such sets. Recent work is reviewed, and we re-examine the underlying formal foundational framework in the light of this. We give a detailed treatment of the coupling t...
متن کاملUsing Random Walks for Mining Web Document Associations
World Wide Web has emerged as a primary means for storing and structuring information. In this paper, we present a framework for mining implicit associations among Web documents. We focus on the following problem: \For a given set of seed URLs, nd a list of Web pages which re ect the association among these seeds." In the proposed framework, associations of two documents are induced by the conn...
متن کاملA PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملRandom Walks between Leaves of Random Networks
We consider random walks that start and are absorbed on the leaves of random networks and study the length of such walks. For the networks we investigate, Erdős-Rényi random graphs and Barabási-Albert scale free networks, these walks are not transient and we consider various approaches to computing the probability of a given length walk. One approach is to label nodes according to both their to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLoS ONE
سال: 2014
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0104813